Partial Boolean algebras in a broader sense and Boolean embeddings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean Algebras in Visser Algebras

We generalize the double negation construction of Boolean algebras in Heyting algebras, to a double negation construction of the same in Visser algebras (also known as basic algebras). This result allows us to generalize Glivenko’s Theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras. Mathematics Subject Classification: P...

متن کامل

Imaginaries in Boolean algebras

Given an infinite Boolean algebra B, we find a natural class of ∅-definable equivalence relations EB such that every imaginary element from B is interdefinable with an element from a sort determined by some equivalence relation from EB . It follows that B together with the family of sorts determined by EB admits elimination of imaginaries in a suitable multisorted language. The paper generalize...

متن کامل

Boolean Algebras and Logic

In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone’s representation theorem. Some special classes of Boolean algebras are also concerned with and, in particular, the relations of Boolean algebras to propositional logic and to set theory are studied in more details. We mention here that all what we do for propositional logic can also be extende...

متن کامل

Boolean algebras and spectrum

For any Boolean algebra we prove a nice-looking recursive formula for the characteristic polynomial of its associated undirected Hasse graph, from which the computation of the spectrum smoothly follows.

متن کامل

Robbins Algebras vs. Boolean Algebras

In the early 1930s, Huntington proposed several axiom systems for Boolean algebras. Robbins slightly changed one of them and asked if the resulted system is still a basis for variety of Boolean algebras. The solution (afirmative answer) was given in 1996 by McCune with the help of automated theorem prover EQP/OTTER. Some simplified and restucturized versions of this proof are known. In our vers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1981

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-45-2-171-180